0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n020.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Thu Jul 4 06:11:39 EDT 2024 0.12/0.33 % CPUTime : 0.20/0.48 Running higher-order theorem proving 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.lHWE2ut7To/E---3.1_30285.p 1.58/0.68 # Version: 3.2.0-ho 1.58/0.68 # Preprocessing class: HSSSSMSSSSSNSSA. 1.58/0.68 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 1.58/0.68 # Starting post_as_ho12 with 180s (1) cores 1.58/0.68 # Starting new_bool_9 with 180s (1) cores 1.58/0.68 # Starting post_as_ho1 with 180s (1) cores 1.58/0.68 # Starting post_as_ho4 with 180s (1) cores 1.58/0.68 # Starting post_as_ho2 with 180s (1) cores 1.58/0.68 # Starting ehoh_best2_full_lfho with 180s (1) cores 1.58/0.68 # Starting full_lambda_10 with 180s (1) cores 1.58/0.68 # Starting new_ho_8 with 180s (1) cores 1.58/0.68 # post_as_ho4 with pid 30436 completed with status 0 1.58/0.68 # Result found by post_as_ho4 1.58/0.68 # Preprocessing class: HSSSSMSSSSSNSSA. 1.58/0.68 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 1.58/0.68 # Starting post_as_ho12 with 180s (1) cores 1.58/0.68 # Starting new_bool_9 with 180s (1) cores 1.58/0.68 # Starting post_as_ho1 with 180s (1) cores 1.58/0.68 # Starting post_as_ho4 with 180s (1) cores 1.58/0.68 # No SInE strategy applied 1.58/0.68 # Search class: HGHSF-FFSS11-SSSFFMBN 1.58/0.68 # partial match(1): HGHSF-FFSF11-SSSFFMBN 1.58/0.68 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 1.58/0.68 # Starting ho_unfolding_6 with 98s (1) cores 1.58/0.68 # ho_unfolding_6 with pid 30443 completed with status 9 1.58/0.68 # Starting post_as_ho4 with 19s (1) cores 1.58/0.68 # post_as_ho4 with pid 30452 completed with status 0 1.58/0.68 # Result found by post_as_ho4 1.58/0.68 # Preprocessing class: HSSSSMSSSSSNSSA. 1.58/0.68 # Scheduled 8 strats onto 8 cores with 180 seconds (1440 total) 1.58/0.68 # Starting post_as_ho12 with 180s (1) cores 1.58/0.68 # Starting new_bool_9 with 180s (1) cores 1.58/0.68 # Starting post_as_ho1 with 180s (1) cores 1.58/0.68 # Starting post_as_ho4 with 180s (1) cores 1.58/0.68 # No SInE strategy applied 1.58/0.68 # Search class: HGHSF-FFSS11-SSSFFMBN 1.58/0.68 # partial match(1): HGHSF-FFSF11-SSSFFMBN 1.58/0.68 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 1.58/0.68 # Starting ho_unfolding_6 with 98s (1) cores 1.58/0.68 # ho_unfolding_6 with pid 30443 completed with status 9 1.58/0.68 # Starting post_as_ho4 with 19s (1) cores 1.58/0.68 # Preprocessing time : 0.001 s 1.58/0.68 # Presaturation interreduction done 1.58/0.68 1.58/0.68 # Proof found! 1.58/0.68 # SZS status Theorem 1.58/0.68 # SZS output start CNFRefutation 1.58/0.68 thf(decl_22, type, cJ: $i). 1.58/0.68 thf(decl_23, type, cLIKE: $i > $i > $o). 1.58/0.68 thf(decl_24, type, cWRH: $i > $o). 1.58/0.68 thf(decl_25, type, cW: $i > $o). 1.58/0.68 thf(decl_26, type, cUNIQUE: $i > $o). 1.58/0.68 thf(decl_27, type, cS: $i). 1.58/0.68 thf(decl_28, type, cP: $i). 1.58/0.68 thf(decl_29, type, esk1_1: ($i > $o) > $i). 1.58/0.68 thf(cLING1, conjecture, (?[X1:$i > $o]:((((X1 @ cJ)<=>?[X2:$i]:(((((cLIKE @ cJ @ X2)&(cWRH @ X2))&(cW @ X2))&(cUNIQUE @ X2))))&((X1 @ cP)<=>(cLIKE @ cP @ cS))))<=((((cUNIQUE @ cS)&(cW @ cS))&(cWRH @ cS))&![X2:$i]:(((cUNIQUE @ X2)=>![X3:$i]:((((cWRH @ X3)&(cW @ X3))=>((X2)=(X3)))))))), file('/export/starexec/sandbox2/tmp/tmp.lHWE2ut7To/E---3.1_30285.p', cLING1)). 1.58/0.68 thf(c_0_1, negated_conjecture, ~((((((cUNIQUE @ cS)&(cW @ cS))&(cWRH @ cS))&![X2:$i]:(((cUNIQUE @ X2)=>![X3:$i]:((((cWRH @ X3)&(cW @ X3))=>((X2)=(X3)))))))=>?[X1:$i > $o]:((((X1 @ cJ)<=>?[X2:$i]:(((((cLIKE @ cJ @ X2)&(cWRH @ X2))&(cW @ X2))&(cUNIQUE @ X2))))&((X1 @ cP)<=>(cLIKE @ cP @ cS)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cLING1])])). 1.58/0.68 thf(c_0_2, negated_conjecture, ![X8:$i, X9:$i, X10:$i > $o, X11:$i]:((((((cUNIQUE @ cS)&(cW @ cS))&(cWRH @ cS))&(~(cUNIQUE @ X8)|(~(cWRH @ X9)|~(cW @ X9)|((X8)=(X9)))))&(((~(X10 @ cP)|~(cLIKE @ cP @ cS)|(~(X10 @ cJ)|(~(cLIKE @ cJ @ X11)|~(cWRH @ X11)|~(cW @ X11)|~(cUNIQUE @ X11))))&((X10 @ cP)|(cLIKE @ cP @ cS)|(~(X10 @ cJ)|(~(cLIKE @ cJ @ X11)|~(cWRH @ X11)|~(cW @ X11)|~(cUNIQUE @ X11)))))&(((((~(X10 @ cP)|~(cLIKE @ cP @ cS)|((cLIKE @ cJ @ (esk1_1 @ X10))|(X10 @ cJ)))&((X10 @ cP)|(cLIKE @ cP @ cS)|((cLIKE @ cJ @ (esk1_1 @ X10))|(X10 @ cJ))))&((~(X10 @ cP)|~(cLIKE @ cP @ cS)|((cWRH @ (esk1_1 @ X10))|(X10 @ cJ)))&((X10 @ cP)|(cLIKE @ cP @ cS)|((cWRH @ (esk1_1 @ X10))|(X10 @ cJ)))))&((~(X10 @ cP)|~(cLIKE @ cP @ cS)|((cW @ (esk1_1 @ X10))|(X10 @ cJ)))&((X10 @ cP)|(cLIKE @ cP @ cS)|((cW @ (esk1_1 @ X10))|(X10 @ cJ)))))&((~(X10 @ cP)|~(cLIKE @ cP @ cS)|((cUNIQUE @ (esk1_1 @ X10))|(X10 @ cJ)))&((X10 @ cP)|(cLIKE @ cP @ cS)|((cUNIQUE @ (esk1_1 @ X10))|(X10 @ cJ)))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 1.58/0.68 thf(c_0_3, negated_conjecture, ![X2:$i, X3:$i]:((((X2)=(X3))|~((cUNIQUE @ X2))|~((cWRH @ X3))|~((cW @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.58/0.68 thf(c_0_4, negated_conjecture, (cW @ cS), inference(split_conjunct,[status(thm)],[c_0_2])). 1.58/0.68 thf(c_0_5, negated_conjecture, (cWRH @ cS), inference(split_conjunct,[status(thm)],[c_0_2])). 1.58/0.68 thf(c_0_6, negated_conjecture, ![X1:$i > $o]:(((X1 @ cP)|(cLIKE @ cP @ cS)|(cUNIQUE @ (esk1_1 @ X1))|(X1 @ cJ))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.58/0.68 thf(c_0_7, negated_conjecture, ![X1:$i > $o, X2:$i]:((~((X1 @ cP))|~((cLIKE @ cP @ cS))|~((X1 @ cJ))|~((cLIKE @ cJ @ X2))|~((cWRH @ X2))|~((cW @ X2))|~((cUNIQUE @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.58/0.68 thf(c_0_8, negated_conjecture, ![X2:$i]:((((X2)=(cS))|~((cUNIQUE @ X2)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3, c_0_4]), c_0_5])])). 1.58/0.68 thf(c_0_9, negated_conjecture, ((cUNIQUE @ (esk1_1 @ (^[Z0/* 4 */:$i]:(~($true)))))|(cLIKE @ cP @ cS)), inference(primitive_enumeration,[status(thm)],[c_0_6])). 1.58/0.68 thf(c_0_10, negated_conjecture, ![X1:$i > $o, X2:$i]:(((X1 @ cP)|(cLIKE @ cP @ cS)|~((X1 @ cJ))|~((cLIKE @ cJ @ X2))|~((cWRH @ X2))|~((cW @ X2))|~((cUNIQUE @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.58/0.68 thf(c_0_11, negated_conjecture, ![X2:$i]:((~((cLIKE @ cP @ cS))|~((cLIKE @ cJ @ X2))|~((cWRH @ X2))|~((cW @ X2))|~((cUNIQUE @ X2)))), inference(primitive_enumeration,[status(thm)],[c_0_7])). 1.58/0.68 thf(c_0_12, negated_conjecture, ![X1:$i > $o]:(((X1 @ cP)|(cLIKE @ cP @ cS)|(cLIKE @ cJ @ (esk1_1 @ X1))|(X1 @ cJ))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.58/0.68 thf(c_0_13, negated_conjecture, (((esk1_1 @ (^[Z0/* 4 */:$i]:(~($true))))=(cS))|(cLIKE @ cP @ cS)), inference(spm,[status(thm)],[c_0_8, c_0_9])). 1.58/0.68 thf(c_0_14, negated_conjecture, ![X2:$i, X1:$i > $o]:(((X1 @ cP)|~((cLIKE @ cJ @ X2))|~((cWRH @ X2))|~((cW @ X2))|~((cUNIQUE @ X2))|~((X1 @ cJ)))), inference(csr,[status(thm)],[c_0_10, c_0_11])). 1.58/0.68 thf(c_0_15, negated_conjecture, ((cLIKE @ cP @ cS)|(cLIKE @ cJ @ cS)), inference(spm,[status(thm)],[c_0_12, c_0_13])). 1.58/0.68 thf(c_0_16, negated_conjecture, ![X2:$i]:((~((cLIKE @ cJ @ X2))|~((cWRH @ X2))|~((cW @ X2))|~((cUNIQUE @ X2)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_11])). 1.58/0.68 thf(c_0_17, negated_conjecture, (cUNIQUE @ cS), inference(split_conjunct,[status(thm)],[c_0_2])). 1.58/0.68 thf(c_0_18, negated_conjecture, ~((cLIKE @ cJ @ cS)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_5]), c_0_4])])). 1.58/0.68 thf(c_0_19, negated_conjecture, ![X1:$i > $o]:(((cUNIQUE @ (esk1_1 @ X1))|(X1 @ cJ)|~((X1 @ cP))|~((cLIKE @ cP @ cS)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.58/0.68 thf(c_0_20, negated_conjecture, (cLIKE @ cP @ cS), inference(sr,[status(thm)],[c_0_15, c_0_18])). 1.58/0.68 thf(c_0_21, negated_conjecture, ![X1:$i > $o]:(((cUNIQUE @ (esk1_1 @ X1))|(X1 @ cJ)|~((X1 @ cP)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_20])])). 1.58/0.68 thf(c_0_22, negated_conjecture, ![X1:$i > $o]:(((cLIKE @ cJ @ (esk1_1 @ X1))|(X1 @ cJ)|~((X1 @ cP))|~((cLIKE @ cP @ cS)))), inference(split_conjunct,[status(thm)],[c_0_2])). 1.58/0.68 thf(c_0_23, negated_conjecture, (cUNIQUE @ (esk1_1 @ (^[Z0/* 3 */:$i]:((cLIKE @ Z0 @ cS))))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_20]), c_0_18])). 1.58/0.68 thf(c_0_24, negated_conjecture, ![X1:$i > $o]:(((cLIKE @ cJ @ (esk1_1 @ X1))|(X1 @ cJ)|~((X1 @ cP)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_20])])). 1.58/0.68 thf(c_0_25, negated_conjecture, ((esk1_1 @ (^[Z0/* 3 */:$i]:((cLIKE @ Z0 @ cS))))=(cS)), inference(spm,[status(thm)],[c_0_8, c_0_23])). 1.58/0.68 thf(c_0_26, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_20]), c_0_18]), c_0_25]), c_0_18]), ['proof']). 1.58/0.68 # SZS output end CNFRefutation 1.58/0.68 # Parsed axioms : 8 1.58/0.68 # Removed by relevancy pruning/SinE : 0 1.58/0.68 # Initial clauses : 21 1.58/0.68 # Removed in clause preprocessing : 7 1.58/0.68 # Initial clauses in saturation : 14 1.58/0.68 # Processed clauses : 60 1.58/0.68 # ...of these trivial : 1 1.58/0.68 # ...subsumed : 3 1.58/0.68 # ...remaining for further processing : 55 1.58/0.68 # Other redundant clauses eliminated : 0 1.58/0.68 # Clauses deleted for lack of memory : 0 1.58/0.68 # Backward-subsumed : 7 1.58/0.68 # Backward-rewritten : 19 1.58/0.68 # Generated clauses : 316 1.58/0.68 # ...of the previous two non-redundant : 139 1.58/0.68 # ...aggressively subsumed : 0 1.58/0.68 # Contextual simplify-reflections : 2 1.58/0.68 # Paramodulations : 242 1.58/0.68 # Factorizations : 0 1.58/0.68 # NegExts : 0 1.58/0.68 # Equation resolutions : 11 1.58/0.68 # Disequality decompositions : 0 1.58/0.68 # Total rewrite steps : 76 1.58/0.68 # ...of those cached : 70 1.58/0.68 # Propositional unsat checks : 0 1.58/0.68 # Propositional check models : 0 1.58/0.68 # Propositional check unsatisfiable : 0 1.58/0.68 # Propositional clauses : 0 1.58/0.68 # Propositional clauses after purity: 0 1.58/0.68 # Propositional unsat core size : 0 1.58/0.68 # Propositional preprocessing time : 0.000 1.58/0.68 # Propositional encoding time : 0.000 1.58/0.68 # Propositional solver time : 0.000 1.58/0.68 # Success case prop preproc time : 0.000 1.58/0.68 # Success case prop encoding time : 0.000 1.58/0.68 # Success case prop solver time : 0.000 1.58/0.68 # Current number of processed clauses : 14 1.58/0.68 # Positive orientable unit clauses : 5 1.58/0.68 # Positive unorientable unit clauses: 0 1.58/0.68 # Negative unit clauses : 1 1.58/0.68 # Non-unit-clauses : 8 1.58/0.68 # Current number of unprocessed clauses: 101 1.58/0.68 # ...number of literals in the above : 526 1.58/0.68 # Current number of archived formulas : 0 1.58/0.68 # Current number of archived clauses : 41 1.58/0.68 # Clause-clause subsumption calls (NU) : 123 1.58/0.68 # Rec. Clause-clause subsumption calls : 21 1.58/0.68 # Non-unit clause-clause subsumptions : 9 1.58/0.68 # Unit Clause-clause subsumption calls : 3 1.58/0.68 # Rewrite failures with RHS unbound : 0 1.58/0.68 # BW rewrite match attempts : 3 1.58/0.68 # BW rewrite match successes : 2 1.58/0.68 # Condensation attempts : 60 1.58/0.68 # Condensation successes : 0 1.58/0.68 # Termbank termtop insertions : 21942 1.58/0.68 # Search garbage collected termcells : 290 1.58/0.68 1.58/0.68 # ------------------------------------------------- 1.58/0.68 # User time : 0.171 s 1.58/0.68 # System time : 0.005 s 1.58/0.68 # Total time : 0.176 s 1.58/0.68 # Maximum resident set size: 1848 pages 1.58/0.68 1.58/0.68 # ------------------------------------------------- 1.58/0.68 # User time : 0.173 s 1.58/0.68 # System time : 0.006 s 1.58/0.68 # Total time : 0.179 s 1.58/0.68 # Maximum resident set size: 1704 pages 1.58/0.68 % E---3.1 exiting 1.58/0.68 % E exiting 1.58/0.69 EOF